Compactness in constructive analysis revisited
نویسندگان
چکیده
منابع مشابه
Compactness in constructive analysis revisited
In [5], [3] we have developed a unified Type 2 theory of computability and continuity and a theory of representations. In a third paper [6] representations useful for a new kind of constructive analysis were presented. As an application of these concepts we shall now consider constructive compactness. We introduce 'reasonable' representations of closed and compact sets and prove two different v...
متن کاملThe Abstract Compactness Theorem revisited
The Abstract Compactness Theorem of Makowsky and Shelah for model theoretic logics is shown to be an immediate consequence of a general characterization of topological spaces having [ ; ]-compact products, when applied to spaces of structures endowed with the natural topology induced by the de nable classes of a logic L. In this context, the notion of an ultra lter U being related to L correspo...
متن کاملConstructive Disjunction Revisited
Finite Domain Programming is a technique for solving com-binatorial problems like planning, scheduling, connguration or timetabling. Inevitably, these problems employ disjunctive constraints. A rather new approach to model those constraints is constructive disjunction, whereby common information is lifted from the alternatives, aiming for stronger pruning of the search space. We show where cons...
متن کاملA Constructive Version of AIP Revisited
In this paper, we review a constructive version of the Approximation Induction Principle. This version states that bisimilarity of regular processes can be decided by observing only a part of their behaviour. We use this constructive version to formulate a complete inference system for the Algebra of Communicating Processes with linear recursive specifications.
متن کاملProgram extraction in constructive analysis
We sketch a development of constructive analysis in Bishop’s style, with special emphasis on low type-level witnesses (using separability of the reals). The goal is to set up things in such a way that realistically executable programs can be extracted from proofs. This is carried out for (1) the Intermediate Value Theorem and (2) the existence of a continuous inverse to a monotonically increasi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1987
ISSN: 0168-0072
DOI: 10.1016/0168-0072(87)90010-8